COMPUTING THE DISTANCE DISTRIBUTION OF SYSTEMATIC NONLINEAR CODES
نویسندگان
چکیده
منابع مشابه
Computing the distance distribution of systematic non-linear codes
The most important families of non-linear codes are systematic. We provide a Gröbner bases technique to compute the distance distribution of systematic nonlinear codes.
متن کاملComputing the minimal distance of cyclic codes
We describe an algorithm that improves on the standard algorithm for computing the minimal distance of cyclic codes.
متن کاملOn the distance distribution of codes
The d i m m e drctrrbutron of a binary code C' is the sequence ( F ! ):lo defined as follows: Let B, ( u t ) he the number of codewords at distance J from the codeword U , and let B, be the average of B, ( I I ) over all n' in C. In this correspondence we study the distance distribution for codes of length t i and minimal distance h n , with h > 0 fixed and n X. Our main aim is to relate the si...
متن کاملComputing Error Distance of Reed-Solomon Codes
Under polynomial time reduction, the maximun likelihood decoding of a linear code is equivalent to computing the error distance of a received word. It is known that the decoding complexity of standard Reed-Solomon codes at certain radius is at least as hard as the discrete logarithm problem over certain large finite fields. This implies that computing the error distance is hard for standard Ree...
متن کاملMinimum Distance of Binary Nonlinear Codes∗
A binary nonlinear code can be represented as the union of cosets of a binary linear subcode. Using this representation, new algorithms methods to compute the minimum Hamming weight and distance are presented. The performance of these algorithms is also studied.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra and Its Applications
سال: 2010
ISSN: 0219-4988,1793-6829
DOI: 10.1142/s0219498810003884